Monotonic Extensions of Petri Nets

Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited

In this paper, we revisit the forward and backward approaches to the verification of extensions of infinite state Petri Nets. As contributions, we propose an efficient data structure to represent infinite downward closed sets of markings and to compute symbolically the minimal coverability set of Petri Nets, we identify a subclass of Transfer Nets for which the forward approach generalizes and ...

On the coverability and reachability languages of monotonic extensions of Petri nets

We apply language theory to compare the expressive power of infinite-state models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we consider extensions of Petri nets in which tokens carry pure names dynamically generated with special ν-transitions (νPN) and compare their expressiveness with transfer and reset nets with black indistinguishab...

Causality in Extensions of Petri Nets

The causal semantics of standard net classes like Elementary Net Systems and Place/Transition Nets, is typically expressed in terms of partially ordered sets of transition occurrences. In each such partial order, causally related occurrences are ordered while concurrent transition occurrences remain unordered. Partial order semantics can, in particular, support model checking by efficient verif...

Well-structured Petri Nets extensions with data

Invariant property preserving extensions of elementary Petri nets

We deene an extension of an elementary Petri net and give a suucient criterion for the preservation of invariant properties. Properties of a net are described by propositional temporal formulas. An elementary Petri net is an extension of another net if the smaller net can be embedded into the larger one by an injective function that maps places on places and transitions on transitions. It is sh...